Concatenated error-correcting entropy codes and channel codes
نویسندگان
چکیده
We propose a general class of concatenated errorcorrecting entropy codes and channel codes. In this way we extend and generalize the existing body of work on iterative decoding of entropy and channel codes. Using the structure and properties of serial concatenated codes, we employ error-correcting entropy codes as the outer code, and a convolutional code as the inner code. The generalization from entropy codes to redundant entropy codes allows powerful error correction similar to turbo codes. We provide upper bounds for the concatenated entropy code and channel code. We also show that iterative decoding of the proposed concatenated code outperforms iterative decoding of previously reported entropy and channel codes that operate at the same overall rate.
منابع مشابه
Performance Evaluation and Comparative Analysis of Various Concatenated Error Correcting Codes Using BPSK Modulation for AWGN Channel
This paper presents the performance evaluation and comparison of various concatenated error correcting codes using Binary Phase Shift Keying (BPSK) modulation scheme. Three concatenated error correcting code pair i.e. Convolutional-Hamming, Convolutional-Cyclic, Convolutional-Bose, Chaudhuri Hocquenghem is designed and the BER performance was measured for an Additive White Gaussian Noise (AWGN)...
متن کاملUsing concatenated algebraic geometry codes in channel polarization
Polar codes were introduced by Arikan [1] in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to...
متن کاملGood Error-Correcting Codes Based On Very Sparse Matrices - Information Theory, IEEE Transactions on
We study two families of error-correcting codes defined in terms of very sparse matrices. “MN” (MacKay–Neal) codes are recently invented, and “Gallager codes” were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The decoding of both codes can be tackled with a practical sum-product algorithm. We prove that these codes are “very good...
متن کاملErrata for "Good error-correcting codes based on very sparse matrices"
We study two families of error-correcting codes defined in terms of very sparse matrices. “MN” (MacKay–Neal) codes are recently invented, and “Gallager codes” were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The decoding of both codes can be tackled with a practical sum-product algorithm. We prove that these codes are “very good...
متن کاملGood Error{correcting Codes Based on Very Sparse Matrices
We study two families of error-correcting codes deened in terms of very sparse matrices. `MN' (MacKay{Neal) codes are recently invented, and`Gallager codes' were rst investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The decoding of both codes can be tackled with a practical sum{product algorithm. We prove that these codes arèvery good', in ...
متن کامل